On Involutions Arising from Graphs
نویسندگان
چکیده
We investigate various aspects of involutions of groups, i.e, anti-automorphisms of order at most two. The emphasis is on finite abelian groups. We count the number of involutions for the cyclic groups, and consider the problem for direct products of groups. We also give a characterization for the set of skewed squares of finitely generated abelian groups with identity as the involution. The present paper is motivated by our research into switching classes of combinatorial graphs where the edges have skew gains.
منابع مشابه
Partition identities arising from involutions
We give a simple combinatorial proof of three identities of Warnaar. The proofs exploit involutions due to Franklin and Schur.
متن کاملThe signed Eulerian numbers on involutions
We de ne an analog of signed Eulerian numbers fn,k for involutions of the symmetric group and derive some combinatorial properties of this sequence. In particular, we exhibit both an explicit formula and a recurrence for fn,k arising from the properties of its generating function.
متن کاملInvolution graphs where the product of two adjacent vertices has order three
An S3-involution graph for a group G is a graph with vertex set a union of conjugacy classes of involutions of G such that two involutions are adjacent if they generate an S3-subgroup in a particular set of conjugacy classes. We investigate such graphs in general and also for the case where G = PSL(2, q).
متن کاملCommuting Involution Graphs for Ãn
Let G be a group and X a subset of G. The commuting graph on X, denoted C(G,X), has vertex set X and an edge joining x, y ∈ X whenever xy = yx. If in addition X is a set of involutions, then C(G,X) is called a commuting involution graph. Commuting graphs have been investigated by many authors. Sometimes they are tools used in the proof of a theorem, or they may be studied as a way of shedding l...
متن کاملGeneralised Ramsey numbers and Bruhat order on involutions
This thesis consists of two papers within two different areas of combinatorics. Ramsey theory is a classic topic in graph theory, and Paper A deals with two of its most fundamental problems: to compute Ramsey numbers and to characterise critical graphs. More precisely, we study generalised Ramsey numbers for two sets Γ1 and Γ2 of cycles. We determine, in particular, all generalised Ramsey numbe...
متن کامل